Complexity of the Logic for Multiagent Systems with Restricted Modal Context

In this paper we continue our research in computational complexity of fragments of a particular belief-desire-intention (BDI) logic for cooperative problem solving (CPS) called TeamLog. The logic in question combines propositional multi-modal logic to express static aspects of CPS with propositional dynamic logic used for dynamic aspects of CPS. We concentrate here on the static fragment of the logic. The complexity of the satisfiability problem for the static fragment of TeamLog is known to be EXPTIME-complete, even if modal depth is bounded by a constant ≥ 2. We show a restriction on modal context of formulas that makes the problem PSPACE-complete without setting boundary on modal depth. Bounding modal depth, additionally, leads to NPTIME-completeness.